Min-Max Dom-Saturation Number of a Tree
نویسندگان
چکیده
Let G = (V,E) be a graph and let v ∈ V. Let γ(v,G) denote the minimum cardinality of a minimal dominating set of G containing v. Then γ(G) = max{γ(v,G) : v ∈ V (G)} is called the min-max dom-saturation number of G. In this paper we present a dynamic programming algorithm for determining the min-max domsaturation number of a tree.
منابع مشابه
Domination analysis of combinatorial optimization problems
We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results proved already in the 1970’s that min TSP (both symmetric and asymmetric versions) is DOM-easy. We prove that several CO problems are DOM-easy including weighted max k-SAT and max cut. W...
متن کاملPreliminaries to Circuits, I 1
This article is the rst in a series of four articles (continued in 24, 23, 25]) about modelling circuits by many-sorted algebras. Here, we introduce some auxiliary notations and prove auxiliary facts about many sorted sets, many sorted functions and trees. One can prove the following proposition (1) For all sets X, Y holds X n Y misses Y. The scheme FraenkelFinIm concerns a nite non empty set A...
متن کاملApproximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a bounded number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملApproximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...
متن کاملDOM tree browsing of a very large XML document: Design and implementation
Browsing the DOM tree of an XML document is an act of following the links among the nodes of the DOM tree to find some desired nodes without any knowledge for search. When the structure of the XML document is not known to a user, browsing is the basic operation performed for referring the contents of the XML document. If the size of the XML document is very large, however, using a general-purpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013